import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Test2 {
    public static void main2(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        int k = in.nextInt();
        int INF = (int)1e5+1;
        // row用来记录哪一行放置的有皇后
        byte[] row = new byte[INF];
        // col用来记录哪一列放置的有皇后
        byte[] col = new byte[INF];
        // cross记录正交线是否放置的有皇后
        byte[] cross = new byte[2*INF+1];
        // reverse记录反交线是否放置的有皇后
        byte[] reverse = new byte[2*INF+1];
        boolean[] judge = new boolean[k+1];
        for (int i = 1; i <= k; i++) {
            int x = in.nextInt();
            int y = in.nextInt();
            if (row[x] == 1 || col[y] == 1 || cross[y-x+k] == 1 || reverse[x+y] == 1) {
                judge[i] = true;
            }
            row[x] = 1;
            col[y] = 1;
            cross[y-x+k] = 1;
            reverse[x+y] = 1;
        }
        int t = in.nextInt();
        for (int i = 0; i < t; i++) {
            int tmp = in.nextInt();
            System.out.println(judge[tmp] ? "Yes" : "No");
        }
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        int k = in.nextInt();
        // row用来记录哪一行放置的有皇后
        Set<Long> row = new HashSet<>();
        // col用来记录哪一列放置的有皇后
        Set<Long> col = new HashSet<>();
        // cross记录正交线是否放置的有皇后
        Set<Long> cross = new HashSet<>();
        // reverse记录反交线是否放置的有皇后
        Set<Long> reverse = new HashSet<>();
        int ret = (int)1e5+10;
        for (int i = 1; i <= k; i++) {
            long x = in.nextLong();
            long y = in.nextLong();
            if (ret != (int)1e5+10) {
                continue;
            }
            if (row.contains(x) || col.contains(y) || cross.contains(y-x) || reverse.contains(x+y)) {
                ret = i;
            }
            row.add(x);
            col.add(y);
            cross.add(y-x);
            reverse.add(x+y);
        }
        int t = in.nextInt();
        for (int i = 0; i < t; i++) {
            int tmp = in.nextInt();
            if (tmp < ret) {
                System.out.println("No");
            } else {
                System.out.println("Yes");
            }
        }
    }
}
